A unique-ID-based matrix strategy for efficient iconic indexing of symbolic pictures

In this paper we propose an e cient iconic indexing strategy called Unique ID based Ma trix UID Matrix for symbolic pictures in which each spatial relationship between any two objects is assigned with a unique identi er ID and is recorded in a matrix Basically the proposed strategy can represent those complex relationships that are represented in D C strings in a matrix and an e cient range checking operation can be used to support pic torial query spatial reasoning and similarity retrieval therefore they are e cient enough as compared to the previous approaches From our simulation we show that the proposed UID matrix strategy requires shorter time to convert the input data into the correspond ing representation than the D C string strategy so does the case of query processing Moreover our proposed UID matrix strategy still can require less storage cost than the D C string strategy in some cases